Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
نویسندگان
چکیده
منابع مشابه
Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels
We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacityachieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme. OCIS codes: (270.5585); (270.5565).
متن کاملChannel Polarization and Polar Codes; Capacity Achieving
A new proposed method for constructing codes that achieves the symmetric capacity (the capacity of the channel with the same probabilities for the inputs), ( ) I W , of any Binary Discrete Memoryless Channel W (B-DMC) will be introduced in this tutorial. This method is based on channel polarization. Channel polarization is the fact that we can synthesize N channels, ( ) { } :1 i N W i N ≤ ≤ , o...
متن کاملConstruction of Capacity-Achieving Lattice Codes: Polar Lattices
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity 1 2 log(1+ SNR) of the additive white Gaussian-noise (AWGN) channel for any signal-to-noise ratio (SNR). Our construction follows the multilevel approach of Forney et al., where on each level we construct a capacityachieving polar code. The component polar codes are nat...
متن کاملCapacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels
We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binaryinput output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their ...
متن کاملCapacity Results for Arbitrarily Varying Wiretap Channels
In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede’s robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2236971